Stability Optimization of Positive Semi-Markov Jump Linear Systems via Convex Optimization
نویسندگان
چکیده
منابع مشابه
Linear Systems . Positive transfer functions and convex optimization 1
Recently, a compact characterization of scalar positive polynomials on the real line and on the unit circle was derived by Nesterov 3]. In this paper we show how to extend this result to pseudo-polynomial matrices, and also present a new proof based on the positive real lemma. The characterization is very similar to the scalar case and also allows the use of fast algorithms for computing the ce...
متن کاملLinear Time Varying MPC Based Path Planning of an Autonomous Vehicle via Convex Optimization
In this paper a new method is introduced for path planning of an autonomous vehicle. In this method, the environment is considered cluttered and with some uncertainty sources. Thus, the state of detected object should be estimated using an optimal filter. To do so, the state distribution is assumed Gaussian. Thus the state vector is estimated by a Kalman filter at each time step. The estimation...
متن کاملStability Analysis of Positive Semi-Markovian Jump Linear Systems with State Resets
This paper studies the mean stability of positive semi-Markovian jump linear systems. We show that their mean stability is characterized by the spectral radius of a matrix that is easy to compute. In deriving the condition we use a certain discretization of a semi-Markovian jump linear system that preserves stability. Also we show a characterization for the exponential mean stability of continu...
متن کاملBounding Iterated Function Systems via Convex Optimization
We present an algorithm to construct a bounding polyhedron for an affine Iterated Function System (IFS). Our algorithm expresses the IFS-bounding problem as a set of linear constraints on a linear objective function, which can then be solved via standard techniques for linear convex optimization. As such, our algorithm is guaranteed to find the optimum recursively instantiable bounding volume, ...
متن کاملSemi-Infinite Optimization under Convex Function Perturbations: Lipschitz Stability
This paper is devoted to the study of the stability of the solution map for the parametric convex semi-infinite optimization problem under convex function perturbations in short, PCSI. We establish sufficient conditions for the pseudo-Lipschitz property of the solution map of PCSI under perturbations of both objective function and constraint set. The main result obtained is new even when the pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SICE Journal of Control, Measurement, and System Integration
سال: 2020
ISSN: 1882-4889,1884-9970
DOI: 10.9746/jcmsi.13.233